On the Average Path Length of Complete m-ary Trees
نویسنده
چکیده
Define the average path length in a connected graph as the sum of the length of the shortest path between all pairs of nodes, divided by the total number of pairs of nodes. Letting SN denote the sum of the shortest path lengths between all pairs of nodes in a complete m-ary tree of depth N , we derive a first-order linear but non-homogeneous recurrence relation for SN , from which a closed-form expression for SN is obtained. Using this explicit expression for SN , we show that the average path length within this graph/network is asymptotic to D − 4 m−1 , where D is the diameter of the m-ary tree, that is, the longest shortest path. This asymptotic estimate for the average path length confirms a conjectured asymptotic estimate in the case of complete binary tree.
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کامل1 5 Se p 20 05 On the number of t - ary trees with a given path length
We show that the number of t-ary trees with path length equal to p is exp ( h(t−1)t log t p log p (1 + o(1)) ) , where h(x)=−x log x−(1−x) log(1−x) is the binary entropy function. Besides its intrinsic combinatorial interest, the question recently arose in the context of information theory, where the number of t-ary trees with path length p estimates the number of universal types, or, equivalen...
متن کاملON THE EXTERNAL PATH LENGTH OF RANDOM RECURSIVE k-ARY TREES
In this paper, we determine the expectation and variance of Xn the external path length in a random recursive k-ary tree of size n.
متن کاملA REPERTOIRE FOR ADDITIVE FUNCTIONALS OF UNIFORMLY DISTRIBUTED m-ARY SEARCH TREES
Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on m-ary search trees on n keys with toll sequence (i) nα with α ≥ 0 (α = 0 and α = 1 correspond roughly to the space requirement and total path length, respectively); (ii) ln ( n m−1 ) , which corresponds to the socalled shape functional; and...
متن کاملA repertoire for additive functionals of uniformly distributed m - ary search trees ( Extended Abstract )
Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on m-ary search trees on n keys with toll sequence (i) n with α ≥ 0 (α = 0 and α = 1 correspond roughly to the space requirement and total path length, respectively); (ii) ln ` n m−1 ́ , which corresponds to the so-called shape functional; and ...
متن کامل